Modern symbolic computation methods: Lyapunov quantities and 16th Hilbert problem
نویسندگان
چکیده
منابع مشابه
An example of symbolic computation of Lyapunov quantities in Maple
In the present paper a realization of a classical method for Lyapunov quantities computation in Maple is considered. Key–Words: Lyapunov quantity, focus values, symbolic computation, small-amplitude limit cycles, Maple, Hilbert 16th problem
متن کاملSymbolic computation of limit cycles associated with Hilbert’s 16th problem
This paper is concerned with the practical complexity of the symbolic computation of limit cycles associated with Hilbert’s 16th problem. In particular, in determining the number of small-amplitude limit cycles of a non-linear dynamical system, one often faces computing the focus values of Hopf-type critical points and solving lengthy coupled polynomial equations. These computations must be car...
متن کاملThe infinitesimal 16th Hilbert problem in dimension zero
We study the analogue of the infinitesimal 16th Hilbert problem in dimension zero. Lower and upper bounds for the number of the zeros of the corresponding Abelian integrals (which are algebraic functions) are found. We study the relation between the vanishing of an Abelian integral I(t) defined over Q and its arithmetic properties. Finally, we give necessary and sufficient conditions for an Abe...
متن کاملTANGENTIAL VERSION OF HILBERT 16th PROBLEM FOR THE ABEL EQUATION
Two classical problems on plane polynomial vector fields, Hilbert’s 16th problem about the maximal number of limit cycles in such a system and Poincaré’s center-focus problem about conditions for all trajectories around a critical point to be closed, can be naturally reformulated for the Abel differential equation y′ = p(x)y + q(x)y. Recently, the center conditions for the Abel equation have be...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SPIIRAS Proceedings
سال: 2014
ISSN: 2078-9599,2078-9181
DOI: 10.15622/sp.16.1